The conjugacy problem in right - angled Artin groups and their subgroups
نویسنده
چکیده
We prove that the conjugacy problem in right-angled Artin groups (RAAGs), as well as in a large and natural class of subgroups of RAAGs, can be solved in linear-time. This class of subgroups contains, for instance, all graph braid groups (i.e. fundamental groups of configuration spaces of points in graphs), many hyperbolic groups, and it coincides with the class of fundamental groups of “special cube complexes” studied independently by Haglund and Wise. AMS Classification 20F36; 20F10, 20F65.
منابع مشابه
The conjugacy problem in subgroups of right-angled Artin groups
We prove that the conjugacy problem in a large and natural class of subgroups of right-angled Artin groups (RAAGs), can be solved in linear-time. This class of subgroups has been previously studied by Crisp and Wiest, and independently by Haglund and Wise, as fundamental groups of compact special cube complexes.
متن کاملHereditary Conjugacy Separability of Right Angled Artin Groups and Its Applications
We prove that finite index subgroups of right angled Artin groups are conjugacy separable. We then apply this result to establish various properties of other classes of groups. In particular, we show that any word hyperbolic Coxeter group contains a conjugacy separable subgroup of finite index and has a residually finite outer automorphism group. Another consequence of the main result is that B...
متن کاملAnti-trees and right-angled Artin subgroups of braid groups
We prove that an arbitrary right-angled Artin group G admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, G admits quasi-isometric group embeddings into a pure braid group and into the area-preserving diffeomorphism groups of the 2–disk and the 2–sphere, answering questions due to Crisp–Wiest and M. Kapovich. Another co...
متن کاملMorse Theory and Conjugacy Classes of Finite Subgroups
We construct a CAT(0) group containing a finitely presented subgroup with infinitely many conjugacy classes of finiteorder elements. Unlike previous examples (which were based on right-angled Artin groups) our ambient CAT(0) group does not contain any rank 3 free abelian subgroups. We also construct examples of groups of type Fn inside mapping class groups, Aut(Fk), and Out(Fk) which have infin...
متن کاملCompressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups
It is shown that the compressed word problem of a graph product of finitely generated groups is polynomial time Turing-reducible to the compressed word problems of the vertex groups. A direct corollary of this result is that the word problem for the automorphism group of a right-angled Artin group or a right-angled Coxeter group can be solved in polynomial time. Moreover, it is shown that a res...
متن کامل